var math/big.intOne

19 uses

	math/big (current package)
		int.go#L38: var intOne = &Int{false, natOne}
		int.go#L254: 	z.Set(intOne)
		int.go#L257: 		i.Add(&i, intOne)
		int.go#L307: 			z.Add(z, intOne)
		int.go#L309: 			z.Sub(z, intOne)
		int.go#L357: 			z.Add(z, intOne)
		int.go#L360: 			z.Sub(z, intOne)
		int.go#L911: 	if d.Cmp(intOne) != 0 {
		int.go#L954: 		if b.Cmp(intOne) == 0 {
		int.go#L994: 	e := new(Int).Add(p, intOne) // e = p + 1
		int.go#L1018: 	beta.Sub(beta, intOne)
		int.go#L1031: 	s.Sub(p, intOne)
		int.go#L1039: 		n.Add(&n, intOne)
		int.go#L1047: 	y.Add(&s, intOne)
		int.go#L1057: 		for t.Cmp(intOne) != 0 {
		intconv.go#L53: var _ fmt.Formatter = intOne // *Int must implement fmt.Formatter
		intconv.go#L231: var _ fmt.Scanner = intOne // *Int must implement fmt.Scanner
		rat.go#L64: 	z.b.Set(intOne)
		rat.go#L443: 		if f := NewInt(0).lehmerGCD(nil, nil, &z.a, &z.b); f.Cmp(intOne) != 0 {